Twelve-choice probability learning with payoffs

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Choice strategies in multiple-cue probability learning.

Choice strategies for selecting among outcomes in multiple-cue probability learning were investigated using a simulated medical diagnosis task. Expected choice probabilities (the proportion of times each outcome was selected given each cue pattern) under alternative choice strategies were constructed from corresponding observed judged probabilities (of each outcome given each cue pattern) and c...

متن کامل

Learning from Inferred Foregone Payoffs

A player’s knowledge of her own actions and the corresponding own payoffs may enable her to infer or form belief about what the payoffs would have been if she had played differently. In studies of low-information game settings, however, players’ ex-post inferences and beliefs have been largely ignored by quantitative learning models. For games with large strategy spaces, the omission may seriou...

متن کامل

The effect of foregone payoffs on underweighting small probability events

Foregone payoffs add information about the outcomes for alternatives that are not chosen. The present paper examines the effect of foregone payoffs on underweighting rare but possible events in repeated choice tasks. Previous studies have not demonstrated any long-lasting effects of foregone payoffs (following repeated presentation of a task) when foregone payoffs do not add much information. T...

متن کامل

Evolution and Learning in Games with Randomly Disturbed Payoffs

We consider four models of evolution and learning in games which rely on perturbations of payoffs, including stochastic fictitious play. In all cases, we establish global stability results for zerosum games, games with an interior ESS, potential games, and supermodular games.

متن کامل

Choice probability generating functions

This paper establishes that every random utility discrete choice model (RUM) has a representation that can be characterized by a choice-probability generating function (CPGF) with speci c properties, and that every function with these speci c properties is consistent with a RUM. The choice probabilities from the RUM are obtained from the gradient of the CPGF. Mixtures of RUM are characterized b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Psychonomic Science

سال: 1967

ISSN: 0033-3131

DOI: 10.3758/bf03331120